A study on parametric multiobjective programming problems without differentiability
نویسندگان
چکیده
منابع مشابه
Solving multiobjective linear programming problems using ball center of polytopes
Here, we aim to develop a new algorithm for solving a multiobjective linear programming problem. The algorithm is to obtain a solution which approximately meets the decision maker's preferences. It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution. Numerical examples and a simulation study are used to illu...
متن کاملA Survey on Different Solution Concepts in Multiobjective Linear Programming Problems with Interval Coefficients
Optimization problems have dedicated a branch of research to themselves for a long time ago. In this field, multiobjective programming has special importance. Since in most real-world multiobjective programming problems the possibility of determining the coefficients certainly is not existed, multiobjective linear programming problems with interval coefficients are investigated in this paper. C...
متن کاملNew optimality conditions for multiobjective fuzzy programming problems
In this paper we study fuzzy multiobjective optimization problems defined for $n$ variables. Based on a new $p$-dimensional fuzzy stationary-point definition, necessary efficiency conditions are obtained. And we prove that these conditions are also sufficient under new fuzzy generalized convexity notions. Furthermore, the results are obtained under general differentiability hypothesis.
متن کاملA goal programming approach for multiobjective linear bilevel programming problems
ABSTRACT: Feasible solutions of Bilevel programming (BLP) problem have to satisfy the optimality conditions of a lower level optimization problem which is defined as part of its constraints. Multiobjective BLP (MOBLP) problems are the special case of BLP problems with multiple objectives at the upper level which require every feasible solution to satisfy the Pareto optimality conditions of a lo...
متن کاملsolving multiobjective linear programming problems using ball center of polytopes
here, we aim to develop a new algorithm for solving a multiobjective linear programming problem. the algorithm is to obtain a solution which approximately meets the decision maker's preferences. it is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution. numerical examples and a simulation study are used to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1993
ISSN: 0898-1221
DOI: 10.1016/0898-1221(93)90062-z